print('NO')
//Author: Manthan-->NoobestOfNoobest
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
using ll=long long int;
#define F first
#define S second
#define fo(i, start, end, jump) for(ll i = (int)start; i <= (int)end; i += (int)jump)
#define rfo(i, start, end, jump) for(ll i = (int)start; i >= (int)end; i -= (int)jump)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define nl '\n'
#define YES cout << "YES\n";
#define NO cout << "NO\n";
#define gl(s) getline(cin,s);
#define tc ll t; cin >> t; while(t--)
#define int long long int
const ll M = 1e9+7;
#define sz(v) (int)v.size()
template <typename T> istream &operator>>(istream &istream, vector<T> &v){ for(auto &i: v) cin >> i; return istream;}
int32_t main(){
ios_base::sync_with_stdio(false); cin.tie(0);
cout << "No\n" << nl;
}
1832. Check if the Sentence Is Pangram | 1678. Goal Parser Interpretation |
1389. Create Target Array in the Given Order | 1313. Decompress Run-Length Encoded List |
1281. Subtract the Product and Sum of Digits of an Integer | 1342. Number of Steps to Reduce a Number to Zero |
1528. Shuffle String | 1365. How Many Numbers Are Smaller Than the Current Number |
771. Jewels and Stones | 1512. Number of Good Pairs |
672. Richest Customer Wealth | 1470. Shuffle the Array |
1431. Kids With the Greatest Number of Candies | 1480. Running Sum of 1d Array |
682. Baseball Game | 496. Next Greater Element I |
232. Implement Queue using Stacks | 844. Backspace String Compare |
20. Valid Parentheses | 746. Min Cost Climbing Stairs |
392. Is Subsequence | 70. Climbing Stairs |
53. Maximum Subarray | 1527A. And Then There Were K |
1689. Partitioning Into Minimum Number Of Deci-Binary Numbers | 318. Maximum Product of Word Lengths |
448. Find All Numbers Disappeared in an Array | 1155. Number of Dice Rolls With Target Sum |
415. Add Strings | 22. Generate Parentheses |